New Strategies for Corn utin the Transitive Closure of a Data!&ase%elation
نویسنده
چکیده
A ia* number of aiQorithms haw been developed to compute the transitive cbaure of a database relation. Thir paper presents two new strategies that furlher reduce the data size dynamlcatly durtng the ocmputatbn and rpeed up the cowergence b the least fixed pdnt of Uw bansittve dosum reiation. A hash-based algorithm Utat in&grates hese new strategies Is then devebped. The performance analysh Mcatea that ule new atgodthm outperforms 0Uwr aiQorHhms in most cases.
منابع مشابه
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملFinite elation Laguerre planes admitting a two-transitive group on their set of generators
We investigate finite elation Laguerre planes admitting a group of automorphisms that is two-transitive on the set of generators. We exclude the sporadic cases of socles in two-transitive groups, as well as the cases with abelian socle (except for the smallest ones, where the Laguerre planes are Miquelian of order at most four). The remaining cases are dealt with in a separate paper. As a conse...
متن کاملData fragmentation for parallel transitive closure strategies - Data Engineering, 1993. Proceedings., Ninth International Conference on
A topic that is currently inspiring a lot of research i s parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduced as a n effective strategy f o r such a computation. It involves reformulating a transitive closure query o n a relation into a number of transitive closure queries o n smaller fragments; these queries can then exec...
متن کاملData fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In 10] the disconnection set approach has been introduced as an eeective strategy for such a computation. It involves reformulating a transitive closure query on a relation into a number of transitive closure queries on smaller fragments; these queries can then execute inde...
متن کاملBSP/CGM Algorithms for the Transitive Closure Problem
We present new implementations of BSP/CGM algorithms for the Transitive Closure Problem. Our strategies deal with size of the message and communication rounds, problems that cause inefficiency in the implementations of the transitive closure algorithms. The algorithms were implemented using LAM/MPI in two Beowulfs. The implementation results show the efficiency and scalability of the presented ...
متن کامل